all-zero code word

См. также в других словарях:

• Code: Breaker — Code:Breaker Cover of the first volume コード: ブレイカー (Kōdo:Bureikā) Genre Action, School Life, Supernatural, Comedy …   Wikipedia

• Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …   Wikipedia

• Berger code — In telecommunication, a Berger code is a unidirectional error detecting code, named after its inventor, J. M. Berger. Berger codes can detect all unidirectional errors. Unidirectional errors are errors that only flip ones into zeroes or only… …   Wikipedia

• Binary Golay code — In mathematics and computer science, a binary Golay code is a type of error correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a particularly deep and interesting connection to the theory …   Wikipedia

• Hamming code — In telecommunication, a Hamming code is a linear error correcting code named after its inventor, Richard Hamming. Hamming codes can detect and correct single bit errors. In other words, the Hamming distance between the transmitted and received… …   Wikipedia

• BCH code — In coding theory the BCH codes form a class of parameterised error correcting codes which have been the subject of much academic attention in the last fifty years. BCH codes were invented in 1959 by Hocquenghem, and independently in 1960 by Bose… …   Wikipedia

• Hadamard code — The Hadamard code, named after Jacques Hadamard, is a system used for signal error detection and correction. It is one of the family of [2 n , n + 1, 2 n − 1] codes. Especially for large n it has a poor rate but it is capable of correcting many… …   Wikipedia

• Reed–Muller code — Reed Muller codes are a family of linear error correcting codes used in communications. They are named after their discoverers, Irving S. Reed and D. E. Muller. Muller discovered the codes, and Reed proposed the majority logic decoding for the… …   Wikipedia

• Polynomial code — In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator… …   Wikipedia

• Block code — In computer science, a block code is a type of channel coding. It adds redundancy to a message so that, at the receiver, one can decode with minimal (theoretically zero) errors, provided that the information rate (amount of transported… …   Wikipedia

• Repetition code — is an (r,1) coding scheme that repeats the bits across a channel to achieve error free communication (r is the number of bits in each codeword for each data bit to be coded). Repetition code is generally a very naive method of encoding data… …   Wikipedia